Polarization and Polar Codes
نویسندگان
چکیده
منابع مشابه
Polarization and Polar Codes
This tutorial treats the fundamentals of polarization theory and polar coding. Arıkan’s original results on binary source and channel polarization methods are studied. Error probability and complexity analyses are offered. The original results are generalized in several directions. Early developments in the field are discussed, pointers to some of the important work omitted from this tutorial a...
متن کاملChannel Polarization and Polar Codes
Polar coding is a new technique introduced by Arıkan [1] based on a phenomenon called channel polarization. Polar codes are appealing as an error correction method since they are proved to achieve the symmetric capacity of any B-DMC using low complexity encoders and decoders, and their block error probability is shown to decrease exponentially in the square root of the block length. In fact, tw...
متن کاملChannel Polarization and Polar Codes; Capacity Achieving
A new proposed method for constructing codes that achieves the symmetric capacity (the capacity of the channel with the same probabilities for the inputs), ( ) I W , of any Binary Discrete Memoryless Channel W (B-DMC) will be introduced in this tutorial. This method is based on channel polarization. Channel polarization is the fact that we can synthesize N channels, ( ) { } :1 i N W i N ≤ ≤ , o...
متن کاملAn efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملPolar Grassmannians and their Codes
We present a concise description of Orthogonal Polar Grassmann Codes and motivate their relevance. We also describe efficient encoding and decoding algorithms for the case of Line Grassmannians and introduce some open problems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Foundations and Trends® in Communications and Information Theory
سال: 2011
ISSN: 1567-2190,1567-2328
DOI: 10.1561/0100000041